On Hausdorff Distance Measures
نویسندگان
چکیده
A number of Hausdorff-based algorithms have been proposed for finding objects in images. We evaluate different measures and argue that the Hausdorff Average distance measure outperforms other variants for model detection. This method has improved robustness properties with respect to noise. We discuss the algorithms with respect to typical classes of noise, and we illustrate their relative performances through an example edge-based matching task. We show that this method produces a maximum a posteriori estimate. Furthermore, we argue for improved computational efficiency by tree-like subdivisions of the model and transformation spaces.
منابع مشابه
New Similarity Measures of Fuzzy Soft Sets Based on Distance Measures
Similarity measure is a very important problem in fuzzy soft set theory. In this paper, seven similarity measures of fuzzy soft sets are introduced, which are based on the normalized Hamming distance, the normalized Euclidean distance, the generalized normalized distance, the Type-2 generalized normalized distance, the Type-2 normalized Euclidean distance, the Hausdorff distance and the Chebysh...
متن کاملImproving shape-based face recognition by means of a supervised discriminant Hausdorff distance
This paper introduces a supervised discriminant Hausdorff distance that fits into the framework for automatic face analysis and recognition proposed in [1]. Our proposal relies solely on face shape variation contrarily to most of the successful model-based approaches, and results show comparable performance to them. The whole framework is based in a new set of Hausdorff measures and defines fac...
متن کاملSimilarity measures of intuitionistic fuzzy sets based on Hausdorff distance
This paper presents a new method for similarity measures between intuitionistic fuzzy sets (IFSs). We will present a method to calculate the distance between IFSs on the basis of the Hausdorff distance. We will then use this distance to generate a new similarity measure to calculate the degree of similarity between IFSs. Finally we will prove some properties of the proposed similarity measure a...
متن کاملObject matching algorithms using robust Hausdorff distance measures
A Hausdorff distance (HD) is one of commonly used measures for object matching. This work analyzes the conventional HD measures and proposes two robust HD measures based on m-estimation and least trimmed square (LTS) which are more efficient than the conventional HD measures. By computer simulation, the matching performance of the conventional and proposed HD measures is compared with synthetic...
متن کاملFr{'e}chet and Hausdorff Queries on $x$-Monotone Trajectories
vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...
متن کاملRiemannian manifolds , spaces of measures and the Gromov - Hausdorff distance ∗
We equip the space M(X) of all Borel probability measures an a compact Riemannian manifold X with a canonical distance function which induces the weak-∗ topology on M(X) and has the following property: the map X 7→ M(X) is Lipschitz continous with respect to the Gromov-Hausdorff distance on the space of all the (isometry classes of) compact metric spaces. Introduction Last century brought sever...
متن کامل